翻訳と辞書 Words near each other ・ Markov algorithm ・ Markov blanket ・ Markov brothers' inequality ・ Markov chain ・ Markov chain approximation method ・ Markov chain geostatistics ・ Markov chain mixing time ・ Markov chain Monte Carlo ・ Markov chains on a measurable state space ・ Markov decision process ・ Markov information source ・ Markov kernel ・ Markov logic network ・ Markov model ・ Markov number ・ Markov partition ・ Markov perfect equilibrium ・ Markov process ・ Markov Processes International ・ Markov property ・ Markov random field ・ Markov renewal process ・ Markov reward model ・ Markov Reward Model Checker ・ Markov spectrum ・ Markov strategy ・ Markov switching multifractal ・ Markov tree ・ Markov's inequality ・ Markov's principle Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Markov partition ： ウィキペディア英語版 Markov partition A Markov partition is a tool used in dynamical systems theory, allowing the methods of symbolic dynamics to be applied to the study of hyperbolic systems. By using a Markov partition, the system can be made to resemble a discrete-time Markov process, with the long-term dynamical characteristics of the system represented as a Markov shift. The appellation 'Markov' is appropriate because the resulting dynamics of the system obeys the Markov property. The Markov partition thus allows standard techniques from symbolic dynamics to be applied, including the computation of expectation values, correlations, topological entropy, topological zeta functions, Fredholm determinants and the like. == Motivation == Let (''M'',''φ'') be a discrete dynamical system. A basic method of studying its dynamics is to find a symbolic representation: a faithful encoding of the points of ''M'' by sequences of symbols such that the map ''φ'' becomes the shift map. Suppose that ''M'' has been divided into a number of pieces ''E''1,''E''2,…,''E''''r'', which are thought to be as small and localized, with virtually no overlaps. The behavior of a point ''x'' under the iterates of ''φ'' can be tracked by recording, for each ''n'', the part ''E''''i'' which contains ''φ''''n''(''x''). This results in an infinite sequence on the alphabet which encodes the point. In general, this encoding may be imprecise (the same sequence may represent many different points) and the set of sequences which arise in this way may be difficult to describe. Under certain conditions, which are made explicit in the rigorous definition of a Markov partition, the assignment of the sequence to a point of ''M'' becomes an almost one-to-one map whose image is a symbolic dynamical system of a special kind called a shift of finite type. In this case, the symbolic representation is a powerful tool for investigating the properties of the dynamical system (''M'',''φ''). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Markov partition」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.